- 
            
              KClist++: A Simple Algorithm for Finding k-Clique DensestSubgraphs in Large Graphs
            
            
            
              
                Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio, Bintao Sun
              
              
 Graph mining, Graph algorithmics
 VLDB2020
 
- 
            
              Finding Heaviest k -Subgraphs and Events in Social Media
            
            
            
              
                Maximilien Danisch, Mauro Sozio, Matthaios Letsios, Oana Denisa Balalau, Emmanuel Orsini
              
              
 Graph mining
 Real-world graphs, Densest-k-Subgraph, Branch and bound
 
- 
            
              Listing k-cliques in Sparse Real-World Graphs
            
            
            
              
                Maximilien Danisch, Mauro Sozio, Oana Balalau
              
              
 Graph algorithmics
 Real-world graph algorithmics
 
- 
            
              Finding events in temporal networks: Segmentation meets densest-subgraph discovery
            
            
            
              
                Mauro Sozio, Aristides Gionis, Polina Rozenshtein, Francesco Bonchi, Nikolaj Tatti
              
              
 Graph mining
 ICDM2018
 
- 
            
              The Community-search Problem and How to Plan a Successful Cocktail Party
            
            
            
              
                Mauro Sozio, Aristides Gionis
              
              
 Graph mining
 KDD2010
 
- 
            
              Large Scale Density-friendly Graph Decomposition via Convex Programming
            
            
            
              
                Maximilien Danisch, T-H. Hubert Chan, Mauro Sozio
              
              
 Graph mining
 Real-world graphs, Density friendly, Densest subgraph, Frank-Wolfe algorithm